On Span Programs
نویسندگان
چکیده
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexity and cryptography: • SL ⊆ ⊕L (a weak Logspace analogue of NP ⊆ ⊕P). • The first super-linear size lower bounds on branching programs that count. • A broader class of functions which posses information-theoretic secret sharing schemes. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov’s general approximation method.
منابع مشابه
Does the Narrative About the Use of Evidence in Priority Setting Vary Across Health Programs Within the Health Sector: A Case Study of 6 Programs in a Low-Income National Healthcare System
Background There is a growing body of literature on evidence-informed priority setting. However, the literature on the use of evidence when setting healthcare priorities in low-income countries (LICs), tends to treat the healthcare system (HCS) as a single unit, despite the existence of multiple programs within the HCS, some of whic...
متن کاملLifting Nullstellensatz to Monotone Span Programs over Any Field
We characterize the size of monotone span programs computing certain “structured” boolean functions by the Nullstellensatz degree of a related unsatisfiable Boolean formula. This yields the first exponential lower bounds for monotone span programs over arbitrary fields, the first exponential separations between monotone span programs over fields of different characteristic, and the first expone...
متن کاملOn the Size of Monotone Span Programs
Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties of monotone span programs related to their size. Using the results of van Dijk (connecting codes and MSPs) and a construction for a dual monotone span program proposed by Cramer and Fehr we prove a non-trivial upper bound for ...
متن کاملConversions among Several Classes of Predicate Encryption and Their Applications
Predicate encryption is an advanced form of public-key encryption that yield high flexibility in terms of access control. In the literature, many predicate encryption schemes have been proposed such as fuzzy-IBE, KP-ABE, CPABE, (doubly) spatial encryption (DSE), and ABE for arithmetic span programs. In this paper, we study relations among them and show that some of them are in fact equivalent b...
متن کاملConversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
Predicate encryption is an advanced form of public-key encryption that yield high flexibility in terms of access control. In the literature, many predicate encryption schemes have been proposed such as fuzzy-IBE, KP-ABE, CP-ABE, (doubly) spatial encryption (DSE), and ABE for arithmetic span programs. In this paper, we study relations among them and show that some of them are in fact equivalent ...
متن کاملSpan programs and quantum query algorithms
Quantum query complexity measures the number of input bits that must be read by a quantum algorithm in order to evaluate a function. Høyer et al. (2007) have generalized the adversary semidefinite program that lower-bounds quantum query complexity. By giving a matching quantum algorithm, we show that the general adversary lower bound is tight for every boolean function. The proof is based on sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993